Iterated Monodromy Groups of Quadratic Polynomials, I

نویسنده

  • LAURENT BARTHOLDI
چکیده

We describe the iterated monodromy groups associated with post-critically finite quadratic polynomials, and explicit their connection to the ‘kneading sequence’ of the polynomial. We then give recursive presentations by generators and relations for these groups, and study some of their properties, like torsion and ‘branchness’.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Laurent Bartholdi And

We describe the iterated monodromy groups associated with post-critically finite quadratic polynomials, and make explicit their connection to the 'kneading sequence' of the polynomial. We then give recursive presentations by generators and relations for these groups, and study some of their properties, like torsion and 'branchness'.

متن کامل

Combinatorics of Polynomial Iterations

A complete description of the iterated monodromy groups of postcritically finite backward polynomial iterations is given in terms of their actions on rooted trees and automata generating them. We describe an iterative algorithm for finding kneading automata associated with post-critically finite topological polynomials and discuss some open questions about iterated monodromy groups of polynomials.

متن کامل

The spectral problem, substitutions and iterated monodromy

We provide a self-similar measure for the self-similar group G acting faithfully on the binary rooted tree, defined as the iterated monodromy group of the quadratic polynomial z + i. We also provide an Lpresentation for G and calculations related to the spectrum of the Markov operator on the Schreier graph of the action of G on the orbit of a point on the boundary of the binary rooted tree.

متن کامل

Blocks of monodromy groups in complex dynamics

Motivated by a problem in complex dynamics, we examine the block structure of the natural action of iterated monodromy groups on the tree of preimages of a generic point. We show that in many cases, including when the polynomial has prime power degree, there are no large blocks other than those arising naturally from the tree structure. However, using a method of construction based on real grap...

متن کامل

Self-similar groups and their geometry

This is an overview of results concerning applications of self-similar groups generated by automata to fractal geometry and dynamical systems. Few proofs are given, interested reader can find the rest of the proofs in the monograph [Nek05]. We associate to every contracting self-similar action a topological space JG called limit space together with a surjective continuous map s : JG −→ JG. On t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006